Hammersley’s process with sources and sinks
نویسندگان
چکیده
منابع مشابه
Hammersley’s process with sources and sinks
We show that, for a stationary version of Hammersley’s process, with Poisson “sources” on the positive x-axis, and Poisson “sinks” on the positive y-axis, an isolated second class particle, located at the origin at time zero, moves asymptotically, with probability one, along the characteristic of a conservation equation for Hammersley’s process. This allows us to show that Hammersley’s process ...
متن کاملHammersley’s Process with Sources and Sinks by Eric Cator
We show that, for a stationary version of Hammersley’s process, with Poisson “sources” on the positive x-axis, and Poisson “sinks” on the positive y-axis, an isolated second-class particle, located at the origin at time zero, moves asymptotically, with probability 1, along the characteristic of a conservation equation for Hammersley’s process. This allows us to show that Hammersley’s process wi...
متن کاملAn invariance result for Hammersley’s process with sources and sinks
Let P1 be a Poisson process of intensity λ1 on the positive x-axis, P2 a Poisson process of intensity λ2 on the positive y-axis, and P a Poisson process of intensity λ1λ2 in the interior of IR +, where P1, P2 and P are independent. Then the extended Hammersley process Lλ1(·, t) with sources and sinks given by P1 and P2, respectively, is distributed as a Poisson point process with intensity λ1 f...
متن کاملIdentifying Sources and Sinks in the Presence of Multiple Agents with Gaussian Process Vector Calculus
In systems of multiple agents, identifying the cause of observed agent dynamics is challenging. Often, these agents operate in diverse, non-stationary environments, where models rely on handcrafted environment-specific features to infer influential regions in the system’s surroundings. To overcome the limitations of these inflexible models, we presentGP-LAPLACE, a technique for locating sources...
متن کاملCounting acyclic digraphs by sources and sinks
We count labeled acyclic digraphs according to the number sources, sinks, and edges. 1. Counting acyclic digraphs by sources. Let An(t;α) = ∑ D αt, where the sum is over all acyclic digraphs D on the vertex set [n] = {1, 2, . . . , n}, e(D) is the number of edges of D, and s(D) is the number of sources of D; that is, the number of vertices of D of indegree 0. Let An(t) = An(t; 1). To find a rec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2005
ISSN: 0091-1798
DOI: 10.1214/009117905000000053